Some Partial Results on the Convergence of Loop-erased Random Walk to Sle(2) in the Natural Parametrization
نویسنده
چکیده
We outline a strategy for showing convergence of loop-erased random walk on the Z square lattice to SLE(2), in the supremum norm topology that takes the time parametrization of the curves into account. The discrete curves are parametrized so that the walker moves at a constant speed determined by the lattice spacing, and the SLE(2) curve has the recently introduced natural time parametrization. Our strategy can be seen as an extension of the one used by Lawler, Schramm, and Werner to prove convergence modulo time parametrization. The crucial extra step is showing that the expected occupation measure of the discrete curve, properly renormalized by the chosen time parametrization, converges to the occupation density of the SLE(2) curve, the so-called SLE Green’s function. Although we do not prove this convergence, we rigorously establish some partial results in this direction including a new loop-erased random walk estimate.
منابع مشابه
Convergence of loop-erased random walk in the natural parameterization
We prove that loop-erased random walk parametrized by renormalized length converges in the lattice size scaling limit to SLE2 parametrized by Minkowski content.
متن کاملThe growth exponent for planar loop-erased random walk
We give a new proof of a result of Kenyon that the growth exponent for loop-erased random walks in two dimensions is 5/4. The proof uses the convergence of LERW to Schramm-Loewner evolution with parameter 2, and is valid for irreducible bounded symmetric random walks on any discrete lattice of R2.
متن کاملScaling Limit of Loop-erased Random Walk
The loop-erased random walk (LERW) was first studied in 1980 by Lawler as an attempt to analyze self-avoiding walk (SAW) which provides a model for the growth of a linear polymer in a good solvent. The self-avoiding walk is simply a path on a lattice that does not visit the same site more than once. Proving things about the collection of all such paths is a formidable challenge to rigorous math...
متن کاملar X iv : m at h / 06 11 77 5 v 1 [ m at h . PR ] 2 5 N ov 2 00 6 Colored loop - erased random walk on the complete graph ∗
Starting from a sequence regarded as a walk through some set of values, we consider the associated loop-erased walk as a sequence of directed edges, with an edge from i to j if the loop erased walk makes a step from i to j. We introduce a coloring of these edges by painting edges with a fixed color as long as the walk does not loop back on itself, then switching to a new color whenever a loop i...
متن کاملThe Loewner difference equation and convergence of loop-erased random walk
We revisit the convergence of loop-erased random walk, LERW, to SLE2 when the curves are parametrized by capacity. We construct a coupling of the chordal version of LERW and chordal SLE2 based on the Green’s function for LERW as martingale observable and using an elementary discrete-time Loewner “difference” equation. This coupling is different than the ones previously considered in this contex...
متن کامل